Tight Cell-Probe Bounds for Online Integer Multiplication and Convolution
نویسندگان
چکیده
We show tight bounds for both online integer multiplication and convolution in the cell-probe model with word size w. For the multiplication problem, one pair of digits, each from one of two n digit numbers that are to be multiplied, is given as input at step i. The online algorithm outputs a single new digit from the product of the numbers before step i + 1. We give a Θ (
منابع مشابه
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
We show time lower bounds for both online integer multiplication and convolution in the cell-probe model with word size w. For the multiplication problem, one pair of digits, each from one of two n digit numbers that are to be multiplied, is given as input at step i. The online algorithm outputs a single new digit from the product of the numbers before step i+ 1. We give a lower bound of Ω( δ w...
متن کاملTime Bounds for Streaming Problems
We give tight cell-probe bounds for the time to compute convolution, multiplication and Hamming distance in a stream. The cell probe model is a particularly strong computational model and subsumes, for example, the popular word RAM model. • We first consider online convolution where the task is to output the inner product between a fixed n-dimensional vector and a vector of the n most recent va...
متن کاملVector convolution in O(n) steps and matrix multiplication in O(n^2) steps : -)
We observe that if we allow for the use of division and the floor function besides multiplication, addition and subtraction then we can compute the arithmetic convolution of two n-dimensional integer vectors in O(n) steps and perform the arithmetic matrix multiplication of two integer n×n matrices in O(n) steps. Hence, any method for proving superlinear (in the input size) lower bounds for the ...
متن کاملCoding-Theoretic Lower Bounds for Boolean Branching Programs
We develop a general method for proving lower bounds on the complexity of branching programs. The proposed proof technique is based on a connection between branching programs and error-correcting codes and makes use of certain classical results in coding theory. Specifically, lower bounds on the complexity of branching programs computing certain important functions follow directly from lower bo...
متن کاملCell-probe bounds for online edit distance and other pattern matching problems
We give cell-probe bounds for the computation of edit distance, Hamming distance, convolution and longest common subsequence in a stream. In this model, a fixed string of n symbols is given and one δ-bit symbol arrives at a time in a stream. After each symbol arrives, the distance between the fixed string and a suffix of most recent symbols of the stream is reported. The cell-probe model is per...
متن کامل